On the Church-Turing Thesis

نویسنده

  • Germano D’Abramo
چکیده

After a brief description of the Church-Turing Thesis, we suggest that, according to the latest results on classical recursive probabilistic solution of the Halting Problem, such thesis is asymptotically false.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypercomputation and the Physical Church-Turing Thesis

A version of the Church-Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical, more than a logico-mathematical, proposition. We review the main approaches to computation beyond Turing definability (‘hypercomputation’): supertask, non-well-founded, analog, quantum, and retrocausal...

متن کامل

Quantum Speed-up of Computations

1. The Physical Church-Turing Thesis. Physicists often interpret the Church-Turing Thesis as saying something about the scope and limitations of physical computing machines. Although this was not the intention of Church or Turing, the Physical Church Turing thesis is interesting in its own right. Consider, for example, Wolfram's formulation: One can expect in fact that universal computers are a...

متن کامل

Did Church and Turing Have a Thesis about Machines ?

This article draws attention to a central dispute in the interpretation of Church’s Thesis. More precisely, we are concerned with the Church-Turing thesis, as it emerged in 1936 when Church endorsed Turing’s characterization of the concept of effective calculability. (The article by Sieg in this volume details this history. It is valuable also to note from Krajewski, also in this volume, that t...

متن کامل

The Church-Turing thesis: Still valid after all these years?

This paper discusses whether recent proposals for so-called hypercomputation would, if realised in practice, invalidate the Church–Turing thesis. 2005 Elsevier Inc. All rights reserved.

متن کامل

Random-Access Machines and the Extended Church-Turing Thesis

We show that a random-access machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended Church-Turing Thesis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006